A correspondence between rooted planar maps and normal planar lambda terms
نویسندگان
چکیده
منابع مشابه
On rooted planar maps and normal planar lambda terms
A rooted planar map is a connected graph embedded in the 2-sphere, with one edge marked and assigned an orientation. A term of the pure lambda calculus is said to be linear if every variable is used exactly once, normal if it contains no β-redexes, and planar if it is linear and the use of variables moreover follows a deterministic stack discipline. We begin by showing that the sequence countin...
متن کاملRestricted rooted non-separable planar maps
Tutte founded the theory of enumeration of planar maps in a series of papers in the 1960s. Rooted non-separable planar maps have connections, for example, to pattern-avoiding permutations, and they are in one-to-one correspondence with the β(1, 0)-trees introduced by Cori, Jacquard and Schaeffer in 1997. In this paper we enumerate 2-face-free rooted non-separable planar maps and obtain restrict...
متن کاملLinear lambda terms as invariants of rooted trivalent maps
The main aim of the article is to give a simple and conceptual account for the correspondence between (α-equivalence classes of) closed linear lambda terms and (isomorphism classes of) rooted trivalent maps on compact oriented surfaces without boundary, as an instance of a more general correspondence between linear lambda terms with a context of free variables and rooted trivalent maps with a b...
متن کاملLeft ternary trees and non-separable rooted planar maps
In this paper, we illustrate a bijective proof of the enumerative formula regarding non-separable rooted planar maps N S, by means of a class L of certain ternary trees (called left trees). Our rst step consists in determining the left trees' combinatorial enumeration according to the number of their internal nodes. We then establish a bijection between the left trees having n internal nodes an...
متن کاملRaney Paths and a Combinatorial Relationship between Rooted Nonseparable Planar Maps and Two-Stack-Sortable Permutations
An encoding of the set of two-stack-sortable permutations (TSS) in terms of lattice paths and ordered lists of strings is obtained. These lattice paths are called Raney paths. The encoding yields combinatorial decompositions for two complementary subsets of TSS, which are the analogues of previously known decompositions for the set of nonseparable rooted planar maps (NS). This provides a combin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2015
ISSN: 1860-5974
DOI: 10.2168/lmcs-11(3:22)2015